Syntactic Characterisations of Polynomial-Time Optimisation Classes
نویسنده
چکیده
In Descriptive Complexity, there is a vast amount of literature on decision problems, and their classes such as P, NP, L and NL. However, research on the descriptive complexity of optimisation problems has been limited. Optimisation problems corresponding to the NP class have been characterised in terms of logic expressions by Papadimitriou and Yannakakis, Panconesi and Ranjan, Kolaitis and Thakur, Khanna et al, and by Zimand. Grädel characterised the polynomial class P of decision problems. In this paper, we attempt to characterise the optimisation versions of P via expressions in second order logic, many of them using universal Horn formulae with successor relations. The polynomially bound versions of maximisation and minimisation problems are treated first, and then the maximisation problems in the “not necessarily polynomially bound” class.
منابع مشابه
Syntactic Characterisations of Polynomial-Time Optimisation Classes (Syntactic Characterizations of Polynomial-Time Optimization Classes)
In Descriptive Complexity, there is a vast amount of literature on decision problems, and their classes such as P, NP, L and NL. However, research on the descriptive complexity of optimisation problems has been limited. Optimisation problems corresponding to the NP class have been characterised in terms of logic expressions by Papadimitriou and Yannakakis, Panconesi and Ranjan, Kolaitis and Tha...
متن کاملClosure Operators for ROBDDs
Program analysis commonly makes use of Boolean functions to express information about run-time states. Many important classes of Boolean functions used this way, such as the monotone functions and the Boolean Horn functions, have simple semantic characterisations. They also have well-known syntactic characterisations in terms of Boolean formulae, say, in conjunctive normal form. Here we are con...
متن کاملLogspace Optimisation Problems and their Approximation Properties
This paper introduces logspace optimisation problems as analogues of the well-studied polynomial-time optimisation problems. Similarly to them, logspace optimisation problems can have vastly different approximation properties, even though the underlying existence and budget problems have the same computational complexity. Numerous natural problems are presented that exhibit such a varying compl...
متن کاملClasses of Submodular Constraints Expressible by Graph Cuts ∗ Stanislav
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the theory of combinatorial optimisation, that instances of VCSPs with submodular constraints can be minimised in polynomial time. However, the general algorithm is of order O(n) and hence rather impractical. In this paper...
متن کاملAverage case approximability of optimisation problems
This thesis combines average-case complexity theory with the approximability of optimisation problems. Both are ways of dealing with the fact that many computational problems are not solvable in polynomial time, unless P = NP. A theoretical framework is established that allows both the classification of optimisation problems with respect to their average-case approximability and the study of th...
متن کامل